Applied Problems of Polyhedron Inscribing Task Solving
نویسندگان
چکیده
منابع مشابه
Solving belief problems: toward a task analysis.
Solving belief problems develops as a skill in normal children during the preschool years. To understand this process of development, it is necessary to provide an analysis of the tasks used to test preschool 'theory of mind' skills. This analysis should allow us to relate the structure of a given task to the underlying cognitive mechanisms that the task engages. In two experiments, we find tha...
متن کاملGreedy Approaches for Solving Task-Allocation Problems with Coalitions
We study task-allocation problems where one wants to minimize the team cost subject to the constraint that each task must be executed by a given number of cooperative agents simultaneously, called the coalition for this task. We use the same principle to develop several efficient and effective (greedy) hillclimbing strategies for determining both which agents belong to the coalition for each ta...
متن کاملGeneralized Reaction Functions for Solving Complex-Task Allocation Problems
We study distributed task-allocation problems where cooperative agents need to perform some tasks simultaneously. Examples are multi-agent routing problems where several agents need to visit some targets simultaneously, for example, to move obstacles out of the way cooperatively. In this paper, we first generalize the concept of reaction functions proposed in the literature to characterize the ...
متن کاملA Distributed Approach To Solving Constrained Multiagent Task Scheduling Problems
The constrained multiagent task scheduling problem is a problem class that describes complex scheduling problems that integrate stochastic task allocation with constraint satisfaction for agents that concurrently execute multiple tasks. The combination of elements from constraint satisfaction, task allocation and resource scheduling produces a challenging class of problems. Unfortunately, exist...
متن کاملK-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems
In this paper, we study distributed algorithms for cooperative agents that allow them to exchange their assigned tasks in order to reduce their team cost. We define a new type of contract, called K-swaps, that describes multiple task exchanges among multiple agents at a time, which generalizes the concept of single task exchanges. We design a distributed algorithm that constructs all possible K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.11.027